./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-3.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/unroll-3.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 a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:17:27,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:17:27,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:17:27,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:17:27,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:17:27,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:17:27,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:17:27,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:17:27,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:17:27,999 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:17:27,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:17:27,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:17:27,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:17:28,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:17:28,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:17:28,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:17:28,001 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:17:28,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:17:28,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:17:28,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:17:28,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:17:28,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:17:28,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:17:28,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:17:28,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:17:28,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:17:28,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:17:28,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:17:28,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:17:28,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:17:28,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:17:28,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:17:28,002 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 -> a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 [2025-03-04 10:17:28,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:17:28,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:17:28,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:17:28,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:17:28,237 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:17:28,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-3.wvr.c [2025-03-04 10:17:29,402 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f3e184cb/ceadcc45d9fb48d9befd14f28feba916/FLAG3419e8172 [2025-03-04 10:17:29,633 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:17:29,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-3.wvr.c [2025-03-04 10:17:29,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f3e184cb/ceadcc45d9fb48d9befd14f28feba916/FLAG3419e8172 [2025-03-04 10:17:29,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f3e184cb/ceadcc45d9fb48d9befd14f28feba916 [2025-03-04 10:17:29,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:17:29,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:17:29,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:17:29,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:17:29,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:17:29,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:17:29" (1/1) ... [2025-03-04 10:17:29,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:29, skipping insertion in model container [2025-03-04 10:17:29,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:17:29" (1/1) ... [2025-03-04 10:17:29,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:17:30,097 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:17:30,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:17:30,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:17:30,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:17:30,131 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:17:30,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30 WrapperNode [2025-03-04 10:17:30,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:17:30,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:17:30,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:17:30,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:17:30,136 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:17:30" (1/1) ... [2025-03-04 10:17:30,141 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:17:30" (1/1) ... [2025-03-04 10:17:30,154 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 130 [2025-03-04 10:17:30,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:17:30,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:17:30,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:17:30,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:17:30,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,186 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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:17:30,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:17:30,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:17:30,196 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:17:30,196 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:17:30,196 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (1/1) ... [2025-03-04 10:17:30,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:17:30,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:30,228 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:17:30,231 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:17:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:17:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:17:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:17:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:17:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:17:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:17:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:17:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:17:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:17:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:17:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:17:30,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:17:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:17:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:17:30,253 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:17:30,345 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:17:30,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:17:30,614 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:17:30,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:17:30,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:17:30,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:17:30,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:17:30 BoogieIcfgContainer [2025-03-04 10:17:30,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:17:30,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:17:30,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:17:30,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:17:30,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:17:29" (1/3) ... [2025-03-04 10:17:30,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eed0c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:17:30, skipping insertion in model container [2025-03-04 10:17:30,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:30" (2/3) ... [2025-03-04 10:17:30,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eed0c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:17:30, skipping insertion in model container [2025-03-04 10:17:30,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:17:30" (3/3) ... [2025-03-04 10:17:30,782 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2025-03-04 10:17:30,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:17:30,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-3.wvr.c that has 3 procedures, 35 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-03-04 10:17:30,793 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:17:30,841 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:17:30,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 88 flow [2025-03-04 10:17:30,892 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-03-04 10:17:30,895 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:17:30,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 3/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-04 10:17:30,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 37 transitions, 88 flow [2025-03-04 10:17:30,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 80 flow [2025-03-04 10:17:30,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:17:30,918 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;@569bb2ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:17:30,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 10:17:30,924 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:17:30,925 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:17:30,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:17:30,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:30,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:17:30,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:30,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash 387306, now seen corresponding path program 1 times [2025-03-04 10:17:30,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:30,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205033284] [2025-03-04 10:17:30,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:30,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:30,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:17:31,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:17:31,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:31,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:31,081 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:17:31,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:31,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205033284] [2025-03-04 10:17:31,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205033284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:31,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:31,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:17:31,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878578016] [2025-03-04 10:17:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:31,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:17:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:31,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:17:31,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:17:31,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-04 10:17:31,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:17:31,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:31,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-04 10:17:31,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:31,246 INFO L124 PetriNetUnfolderBase]: 88/211 cut-off events. [2025-03-04 10:17:31,246 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 10:17:31,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 211 events. 88/211 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 876 event pairs, 64 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 332. Up to 153 conditions per place. [2025-03-04 10:17:31,251 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 19 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-03-04 10:17:31,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 116 flow [2025-03-04 10:17:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-04 10:17:31,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2025-03-04 10:17:31,267 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 80 flow. Second operand 3 states and 62 transitions. [2025-03-04 10:17:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 116 flow [2025-03-04 10:17:31,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:31,272 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 70 flow [2025-03-04 10:17:31,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-03-04 10:17:31,276 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2025-03-04 10:17:31,276 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 70 flow [2025-03-04 10:17:31,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:17:31,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:31,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:17:31,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:17:31,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:31,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash 387307, now seen corresponding path program 1 times [2025-03-04 10:17:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:31,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989483033] [2025-03-04 10:17:31,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:31,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:17:31,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:17:31,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:31,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:31,564 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:17:31,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:31,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989483033] [2025-03-04 10:17:31,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989483033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:31,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:31,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:17:31,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743953315] [2025-03-04 10:17:31,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:31,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:17:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:31,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:17:31,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:17:31,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-04 10:17:31,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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:17:31,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:31,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-04 10:17:31,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:31,685 INFO L124 PetriNetUnfolderBase]: 88/213 cut-off events. [2025-03-04 10:17:31,686 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:17:31,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 213 events. 88/213 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 874 event pairs, 64 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 362. Up to 157 conditions per place. [2025-03-04 10:17:31,689 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 22 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-04 10:17:31,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 122 flow [2025-03-04 10:17:31,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-04 10:17:31,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5855855855855856 [2025-03-04 10:17:31,691 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 70 flow. Second operand 3 states and 65 transitions. [2025-03-04 10:17:31,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 122 flow [2025-03-04 10:17:31,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:31,692 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 80 flow [2025-03-04 10:17:31,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-03-04 10:17:31,693 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-03-04 10:17:31,693 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 80 flow [2025-03-04 10:17:31,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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:17:31,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:31,693 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:17:31,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:17:31,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:31,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:31,694 INFO L85 PathProgramCache]: Analyzing trace with hash 372214544, now seen corresponding path program 1 times [2025-03-04 10:17:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:31,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946627601] [2025-03-04 10:17:31,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:31,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:17:31,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:17:31,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:31,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:31,940 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:17:31,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946627601] [2025-03-04 10:17:31,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946627601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579304753] [2025-03-04 10:17:31,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:31,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:31,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:31,945 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:17:31,947 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:17:31,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:17:31,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:17:31,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:31,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:31,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:17:31,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:32,042 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:17:32,132 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:17:32,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:32,193 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:17:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579304753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:32,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:17:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965046856] [2025-03-04 10:17:32,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:32,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:17:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:32,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:17:32,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:32,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-04 10:17:32,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 80 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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:17:32,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:32,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-04 10:17:32,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:32,415 INFO L124 PetriNetUnfolderBase]: 89/215 cut-off events. [2025-03-04 10:17:32,416 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:17:32,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 215 events. 89/215 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 886 event pairs, 64 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 378. Up to 154 conditions per place. [2025-03-04 10:17:32,417 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 18 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2025-03-04 10:17:32,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 140 flow [2025-03-04 10:17:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:17:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:17:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2025-03-04 10:17:32,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-03-04 10:17:32,421 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 80 flow. Second operand 7 states and 119 transitions. [2025-03-04 10:17:32,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 140 flow [2025-03-04 10:17:32,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:32,422 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 104 flow [2025-03-04 10:17:32,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-03-04 10:17:32,422 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2025-03-04 10:17:32,423 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 104 flow [2025-03-04 10:17:32,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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:17:32,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:32,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:32,430 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:17:32,623 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:17:32,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:32,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:32,624 INFO L85 PathProgramCache]: Analyzing trace with hash -959581430, now seen corresponding path program 1 times [2025-03-04 10:17:32,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:32,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303818340] [2025-03-04 10:17:32,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:32,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:32,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:17:32,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:17:32,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:32,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:32,660 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:17:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:32,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303818340] [2025-03-04 10:17:32,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303818340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:32,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:17:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133885040] [2025-03-04 10:17:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:32,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:17:32,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:32,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:17:32,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:17:32,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-04 10:17:32,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:17:32,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:32,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-04 10:17:32,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:32,733 INFO L124 PetriNetUnfolderBase]: 89/188 cut-off events. [2025-03-04 10:17:32,733 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:17:32,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 188 events. 89/188 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 620 event pairs, 64 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 335. Up to 153 conditions per place. [2025-03-04 10:17:32,737 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-03-04 10:17:32,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 148 flow [2025-03-04 10:17:32,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:17:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:17:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-04 10:17:32,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41216216216216217 [2025-03-04 10:17:32,738 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 104 flow. Second operand 4 states and 61 transitions. [2025-03-04 10:17:32,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 148 flow [2025-03-04 10:17:32,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 133 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:17:32,739 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 87 flow [2025-03-04 10:17:32,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2025-03-04 10:17:32,740 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-03-04 10:17:32,740 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 87 flow [2025-03-04 10:17:32,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:17:32,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:32,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:32,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:17:32,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash -959581429, now seen corresponding path program 1 times [2025-03-04 10:17:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:32,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370768938] [2025-03-04 10:17:32,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:32,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:17:32,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:17:32,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:32,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:32,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:32,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370768938] [2025-03-04 10:17:32,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370768938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:32,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449960042] [2025-03-04 10:17:32,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:32,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:32,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:32,935 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:17:32,937 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:17:32,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:17:32,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:17:32,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:32,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:32,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:17:32,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:33,002 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:17:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:33,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:33,161 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:17:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449960042] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:33,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:17:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 9 [2025-03-04 10:17:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134737025] [2025-03-04 10:17:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:33,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:33,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:33,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:33,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-04 10:17:33,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:17:33,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:33,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-04 10:17:33,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:33,264 INFO L124 PetriNetUnfolderBase]: 175/337 cut-off events. [2025-03-04 10:17:33,264 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:17:33,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 337 events. 175/337 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1344 event pairs, 64 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 638. Up to 165 conditions per place. [2025-03-04 10:17:33,266 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 38 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-03-04 10:17:33,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 204 flow [2025-03-04 10:17:33,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:17:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:17:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-04 10:17:33,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2025-03-04 10:17:33,267 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 87 flow. Second operand 4 states and 90 transitions. [2025-03-04 10:17:33,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 204 flow [2025-03-04 10:17:33,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:33,268 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 100 flow [2025-03-04 10:17:33,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-03-04 10:17:33,269 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-03-04 10:17:33,269 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 100 flow [2025-03-04 10:17:33,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:17:33,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:33,269 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:33,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:17:33,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:33,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:33,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1260228686, now seen corresponding path program 1 times [2025-03-04 10:17:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835030610] [2025-03-04 10:17:33,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:33,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:17:33,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:17:33,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:33,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:33,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:33,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835030610] [2025-03-04 10:17:33,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835030610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:33,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582618781] [2025-03-04 10:17:33,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:33,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:33,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:33,599 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:17:33,601 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:17:33,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:17:33,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:17:33,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:33,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:33,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:17:33,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:33,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:33,793 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 36 treesize of output 32 [2025-03-04 10:17:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:33,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582618781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:33,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:33,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 10:17:33,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115756527] [2025-03-04 10:17:33,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:33,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:17:33,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:33,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:17:33,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:17:34,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-04 10:17:34,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 100 flow. Second operand has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:17:34,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:34,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-04 10:17:34,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:34,463 INFO L124 PetriNetUnfolderBase]: 366/744 cut-off events. [2025-03-04 10:17:34,463 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 10:17:34,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 744 events. 366/744 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3826 event pairs, 189 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 781. Up to 305 conditions per place. [2025-03-04 10:17:34,467 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 63 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2025-03-04 10:17:34,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 78 transitions, 358 flow [2025-03-04 10:17:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:17:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:17:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2025-03-04 10:17:34,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.597972972972973 [2025-03-04 10:17:34,468 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 100 flow. Second operand 8 states and 177 transitions. [2025-03-04 10:17:34,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 78 transitions, 358 flow [2025-03-04 10:17:34,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:34,469 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 154 flow [2025-03-04 10:17:34,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-03-04 10:17:34,470 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-03-04 10:17:34,470 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 154 flow [2025-03-04 10:17:34,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:17:34,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:34,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:34,476 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:17:34,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:34,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:34,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1241342345, now seen corresponding path program 1 times [2025-03-04 10:17:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:34,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068786820] [2025-03-04 10:17:34,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:34,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:34,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:17:34,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:17:34,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:34,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068786820] [2025-03-04 10:17:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068786820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766133963] [2025-03-04 10:17:34,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:34,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:34,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:34,796 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:17:34,798 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:17:34,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:17:34,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:17:34,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:34,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:34,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:17:34,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:34,867 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:17:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:34,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:35,012 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:17:35,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766133963] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:35,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:17:35,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 9 [2025-03-04 10:17:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422783597] [2025-03-04 10:17:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:35,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:35,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:35,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:35,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:35,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 10:17:35,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:17:35,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:35,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 10:17:35,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:35,178 INFO L124 PetriNetUnfolderBase]: 583/1037 cut-off events. [2025-03-04 10:17:35,178 INFO L125 PetriNetUnfolderBase]: For 596/628 co-relation queries the response was YES. [2025-03-04 10:17:35,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 1037 events. 583/1037 cut-off events. For 596/628 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4783 event pairs, 162 based on Foata normal form. 32/941 useless extension candidates. Maximal degree in co-relation 1657. Up to 665 conditions per place. [2025-03-04 10:17:35,184 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 44 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2025-03-04 10:17:35,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 304 flow [2025-03-04 10:17:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:17:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:17:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 10:17:35,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2025-03-04 10:17:35,185 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 154 flow. Second operand 4 states and 80 transitions. [2025-03-04 10:17:35,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 304 flow [2025-03-04 10:17:35,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 297 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:17:35,188 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 169 flow [2025-03-04 10:17:35,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-03-04 10:17:35,188 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-03-04 10:17:35,190 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 169 flow [2025-03-04 10:17:35,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:17:35,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:35,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:35,196 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:17:35,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:35,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:35,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash -173092541, now seen corresponding path program 1 times [2025-03-04 10:17:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104726097] [2025-03-04 10:17:35,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:35,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:35,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:17:35,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:17:35,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:35,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:35,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:35,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104726097] [2025-03-04 10:17:35,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104726097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:35,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437941318] [2025-03-04 10:17:35,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:35,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:35,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:35,537 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:17:35,541 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:17:35,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:17:35,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:17:35,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:35,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:35,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:17:35,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:35,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:35,718 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 29 treesize of output 25 [2025-03-04 10:17:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:35,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437941318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:35,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:35,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 10:17:35,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710331612] [2025-03-04 10:17:35,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:35,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:17:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:35,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:17:35,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:17:35,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 10:17:35,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 169 flow. Second operand has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:17:35,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:35,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 10:17:35,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:36,275 INFO L124 PetriNetUnfolderBase]: 629/1108 cut-off events. [2025-03-04 10:17:36,276 INFO L125 PetriNetUnfolderBase]: For 722/764 co-relation queries the response was YES. [2025-03-04 10:17:36,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1108 events. 629/1108 cut-off events. For 722/764 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5083 event pairs, 322 based on Foata normal form. 0/980 useless extension candidates. Maximal degree in co-relation 1781. Up to 841 conditions per place. [2025-03-04 10:17:36,280 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 58 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2025-03-04 10:17:36,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 397 flow [2025-03-04 10:17:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:17:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:17:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-03-04 10:17:36,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5366795366795367 [2025-03-04 10:17:36,282 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 169 flow. Second operand 7 states and 139 transitions. [2025-03-04 10:17:36,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 397 flow [2025-03-04 10:17:36,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 388 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:36,285 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 190 flow [2025-03-04 10:17:36,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2025-03-04 10:17:36,285 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2025-03-04 10:17:36,285 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 190 flow [2025-03-04 10:17:36,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:17:36,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:36,286 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:36,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:17:36,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:36,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash 650455689, now seen corresponding path program 2 times [2025-03-04 10:17:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282673360] [2025-03-04 10:17:36,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:36,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:17:36,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:17:36,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:36,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:36,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:36,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282673360] [2025-03-04 10:17:36,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282673360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:36,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645114975] [2025-03-04 10:17:36,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:36,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:36,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:36,583 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:17:36,584 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:17:36,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:17:36,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:17:36,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:36,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:36,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:17:36,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:36,643 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:17:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:36,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:36,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645114975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:36,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:36,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:17:36,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614877730] [2025-03-04 10:17:36,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:36,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:17:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:36,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:17:36,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:36,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-04 10:17:36,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 190 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:36,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:36,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-04 10:17:36,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:37,138 INFO L124 PetriNetUnfolderBase]: 491/943 cut-off events. [2025-03-04 10:17:37,138 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-03-04 10:17:37,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 943 events. 491/943 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4786 event pairs, 280 based on Foata normal form. 0/879 useless extension candidates. Maximal degree in co-relation 1560. Up to 640 conditions per place. [2025-03-04 10:17:37,145 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 36 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2025-03-04 10:17:37,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 321 flow [2025-03-04 10:17:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-04 10:17:37,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2025-03-04 10:17:37,147 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 190 flow. Second operand 5 states and 96 transitions. [2025-03-04 10:17:37,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 321 flow [2025-03-04 10:17:37,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 304 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:17:37,150 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 189 flow [2025-03-04 10:17:37,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-04 10:17:37,151 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-03-04 10:17:37,151 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 189 flow [2025-03-04 10:17:37,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:37,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:37,152 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:37,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:17:37,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:37,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:37,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1896186264, now seen corresponding path program 2 times [2025-03-04 10:17:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:37,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113672811] [2025-03-04 10:17:37,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:37,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:17:37,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-04 10:17:37,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:37,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:17:37,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:37,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113672811] [2025-03-04 10:17:37,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113672811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:37,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:37,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:17:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253767158] [2025-03-04 10:17:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:37,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:37,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:37,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:37,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:17:37,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 10:17:37,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:37,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:37,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 10:17:37,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:37,756 INFO L124 PetriNetUnfolderBase]: 537/949 cut-off events. [2025-03-04 10:17:37,756 INFO L125 PetriNetUnfolderBase]: For 1139/1139 co-relation queries the response was YES. [2025-03-04 10:17:37,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 949 events. 537/949 cut-off events. For 1139/1139 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4199 event pairs, 322 based on Foata normal form. 32/885 useless extension candidates. Maximal degree in co-relation 1659. Up to 684 conditions per place. [2025-03-04 10:17:37,760 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 37 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2025-03-04 10:17:37,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 330 flow [2025-03-04 10:17:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-03-04 10:17:37,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-03-04 10:17:37,761 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 189 flow. Second operand 5 states and 85 transitions. [2025-03-04 10:17:37,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 330 flow [2025-03-04 10:17:37,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 298 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:37,763 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 177 flow [2025-03-04 10:17:37,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-04 10:17:37,763 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2025-03-04 10:17:37,763 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 177 flow [2025-03-04 10:17:37,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:37,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:37,764 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:37,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:17:37,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:37,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1656261263, now seen corresponding path program 1 times [2025-03-04 10:17:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:37,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773720719] [2025-03-04 10:17:37,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:37,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:17:37,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:17:37,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:37,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:37,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:37,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773720719] [2025-03-04 10:17:37,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773720719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:37,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638776566] [2025-03-04 10:17:37,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:37,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:37,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:37,873 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:17:37,875 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:17:37,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:17:37,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:17:37,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:37,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:37,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:17:37,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:38,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:38,073 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 36 treesize of output 32 [2025-03-04 10:17:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638776566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:38,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 10:17:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933114644] [2025-03-04 10:17:38,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:38,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:17:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:38,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:17:38,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:17:38,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 10:17:38,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 177 flow. Second operand has 17 states, 17 states have (on average 13.470588235294118) internal successors, (229), 17 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:17:38,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:38,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 10:17:38,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:38,651 INFO L124 PetriNetUnfolderBase]: 514/910 cut-off events. [2025-03-04 10:17:38,652 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2025-03-04 10:17:38,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 910 events. 514/910 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3975 event pairs, 274 based on Foata normal form. 16/862 useless extension candidates. Maximal degree in co-relation 1616. Up to 431 conditions per place. [2025-03-04 10:17:38,655 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 65 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2025-03-04 10:17:38,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 456 flow [2025-03-04 10:17:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:17:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:17:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2025-03-04 10:17:38,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5304054054054054 [2025-03-04 10:17:38,657 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 177 flow. Second operand 8 states and 157 transitions. [2025-03-04 10:17:38,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 456 flow [2025-03-04 10:17:38,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 434 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:38,659 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 203 flow [2025-03-04 10:17:38,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=203, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-03-04 10:17:38,660 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-03-04 10:17:38,660 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 203 flow [2025-03-04 10:17:38,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.470588235294118) internal successors, (229), 17 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:17:38,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:38,660 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:38,666 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:17:38,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:38,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:38,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1874686134, now seen corresponding path program 2 times [2025-03-04 10:17:38,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:38,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764129252] [2025-03-04 10:17:38,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:38,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:38,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:17:38,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 16 statements. [2025-03-04 10:17:38,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:38,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764129252] [2025-03-04 10:17:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764129252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43343860] [2025-03-04 10:17:38,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:38,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:38,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:38,948 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:17:38,950 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:17:38,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:17:39,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 16 statements. [2025-03-04 10:17:39,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:39,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:39,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:17:39,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:39,023 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:17:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:39,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:39,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43343860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:39,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:39,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:17:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976882609] [2025-03-04 10:17:39,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:39,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:17:39,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:39,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:17:39,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:39,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 10:17:39,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 203 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:39,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:39,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 10:17:39,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:39,544 INFO L124 PetriNetUnfolderBase]: 491/871 cut-off events. [2025-03-04 10:17:39,545 INFO L125 PetriNetUnfolderBase]: For 934/934 co-relation queries the response was YES. [2025-03-04 10:17:39,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 871 events. 491/871 cut-off events. For 934/934 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3803 event pairs, 200 based on Foata normal form. 16/887 useless extension candidates. Maximal degree in co-relation 1555. Up to 450 conditions per place. [2025-03-04 10:17:39,548 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 39 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2025-03-04 10:17:39,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 351 flow [2025-03-04 10:17:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-03-04 10:17:39,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2025-03-04 10:17:39,549 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 203 flow. Second operand 5 states and 83 transitions. [2025-03-04 10:17:39,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 351 flow [2025-03-04 10:17:39,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 334 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 10:17:39,554 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 197 flow [2025-03-04 10:17:39,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2025-03-04 10:17:39,555 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-04 10:17:39,555 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 197 flow [2025-03-04 10:17:39,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:39,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:39,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:39,562 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:17:39,760 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,SelfDestructingSolverStorable11 [2025-03-04 10:17:39,760 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:39,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash -434559828, now seen corresponding path program 1 times [2025-03-04 10:17:39,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:39,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556513232] [2025-03-04 10:17:39,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:39,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:17:39,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:17:39,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:39,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556513232] [2025-03-04 10:17:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556513232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:39,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:39,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:17:39,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263806133] [2025-03-04 10:17:39,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:39,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:17:39,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:39,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:17:39,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:17:39,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:17:39,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:17:39,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:39,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:17:39,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:39,875 INFO L124 PetriNetUnfolderBase]: 491/867 cut-off events. [2025-03-04 10:17:39,876 INFO L125 PetriNetUnfolderBase]: For 965/965 co-relation queries the response was YES. [2025-03-04 10:17:39,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2558 conditions, 867 events. 491/867 cut-off events. For 965/965 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3721 event pairs, 144 based on Foata normal form. 2/869 useless extension candidates. Maximal degree in co-relation 1607. Up to 679 conditions per place. [2025-03-04 10:17:39,879 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 43 selfloop transitions, 5 changer transitions 1/50 dead transitions. [2025-03-04 10:17:39,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 338 flow [2025-03-04 10:17:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 10:17:39,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6936936936936937 [2025-03-04 10:17:39,880 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 197 flow. Second operand 3 states and 77 transitions. [2025-03-04 10:17:39,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 338 flow [2025-03-04 10:17:39,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:39,882 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 214 flow [2025-03-04 10:17:39,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-03-04 10:17:39,882 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-03-04 10:17:39,882 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 214 flow [2025-03-04 10:17:39,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:17:39,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:39,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:39,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:17:39,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:39,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash 963885385, now seen corresponding path program 1 times [2025-03-04 10:17:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:39,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598663151] [2025-03-04 10:17:39,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:39,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:17:39,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:17:39,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:39,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:39,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:39,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598663151] [2025-03-04 10:17:39,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598663151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:39,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:39,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:17:39,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543144743] [2025-03-04 10:17:39,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:39,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:39,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:39,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:17:39,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:17:39,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:39,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:39,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:17:39,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:40,063 INFO L124 PetriNetUnfolderBase]: 573/1033 cut-off events. [2025-03-04 10:17:40,063 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-03-04 10:17:40,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1033 events. 573/1033 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5115 event pairs, 192 based on Foata normal form. 32/1065 useless extension candidates. Maximal degree in co-relation 1890. Up to 500 conditions per place. [2025-03-04 10:17:40,068 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 68 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2025-03-04 10:17:40,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 82 transitions, 602 flow [2025-03-04 10:17:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-04 10:17:40,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2025-03-04 10:17:40,068 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 214 flow. Second operand 5 states and 125 transitions. [2025-03-04 10:17:40,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 82 transitions, 602 flow [2025-03-04 10:17:40,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 587 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:40,071 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 328 flow [2025-03-04 10:17:40,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2025-03-04 10:17:40,072 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2025-03-04 10:17:40,072 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 328 flow [2025-03-04 10:17:40,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:40,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:40,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:40,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:17:40,072 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash 688965203, now seen corresponding path program 2 times [2025-03-04 10:17:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192471879] [2025-03-04 10:17:40,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:40,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:40,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:17:40,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:17:40,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:17:40,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192471879] [2025-03-04 10:17:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192471879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953344624] [2025-03-04 10:17:40,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:40,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:40,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:40,227 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:17:40,229 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:17:40,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:17:40,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:17:40,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:17:40,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:40,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:17:40,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:40,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953344624] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:40,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:17:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 5] total 11 [2025-03-04 10:17:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733239791] [2025-03-04 10:17:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:40,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:17:40,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:40,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:17:40,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:40,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:17:40,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:17:40,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:40,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:17:40,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:40,487 INFO L124 PetriNetUnfolderBase]: 593/1067 cut-off events. [2025-03-04 10:17:40,487 INFO L125 PetriNetUnfolderBase]: For 2153/2153 co-relation queries the response was YES. [2025-03-04 10:17:40,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 1067 events. 593/1067 cut-off events. For 2153/2153 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5068 event pairs, 107 based on Foata normal form. 14/1081 useless extension candidates. Maximal degree in co-relation 2373. Up to 696 conditions per place. [2025-03-04 10:17:40,492 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 56 selfloop transitions, 15 changer transitions 1/73 dead transitions. [2025-03-04 10:17:40,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 628 flow [2025-03-04 10:17:40,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:17:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:17:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-04 10:17:40,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-03-04 10:17:40,493 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 328 flow. Second operand 4 states and 96 transitions. [2025-03-04 10:17:40,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 628 flow [2025-03-04 10:17:40,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 597 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:40,498 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 409 flow [2025-03-04 10:17:40,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2025-03-04 10:17:40,499 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-03-04 10:17:40,499 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 409 flow [2025-03-04 10:17:40,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:17:40,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:40,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:40,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:17:40,703 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:17:40,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:40,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2015192607, now seen corresponding path program 3 times [2025-03-04 10:17:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842603899] [2025-03-04 10:17:40,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:17:40,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:40,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:17:40,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:17:40,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:17:40,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842603899] [2025-03-04 10:17:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842603899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40495972] [2025-03-04 10:17:40,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:17:40,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:40,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:40,846 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:17:40,848 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:17:40,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:17:40,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:17:40,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:17:40,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:40,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:17:40,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:41,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:17:41,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40495972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:41,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:17:41,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2025-03-04 10:17:41,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495780625] [2025-03-04 10:17:41,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:41,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:41,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:41,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:17:41,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:17:41,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:41,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:41,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:17:41,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:41,833 INFO L124 PetriNetUnfolderBase]: 595/1059 cut-off events. [2025-03-04 10:17:41,833 INFO L125 PetriNetUnfolderBase]: For 3111/3111 co-relation queries the response was YES. [2025-03-04 10:17:41,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 1059 events. 595/1059 cut-off events. For 3111/3111 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5146 event pairs, 180 based on Foata normal form. 22/1081 useless extension candidates. Maximal degree in co-relation 2844. Up to 546 conditions per place. [2025-03-04 10:17:41,838 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 74 selfloop transitions, 19 changer transitions 8/102 dead transitions. [2025-03-04 10:17:41,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 977 flow [2025-03-04 10:17:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:17:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:17:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-03-04 10:17:41,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-03-04 10:17:41,839 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 409 flow. Second operand 6 states and 144 transitions. [2025-03-04 10:17:41,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 977 flow [2025-03-04 10:17:41,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 957 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-03-04 10:17:41,844 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 586 flow [2025-03-04 10:17:41,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=586, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-04 10:17:41,844 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 29 predicate places. [2025-03-04 10:17:41,845 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 586 flow [2025-03-04 10:17:41,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:41,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:41,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:41,850 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:17:42,049 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:17:42,049 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:42,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:42,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2040244073, now seen corresponding path program 4 times [2025-03-04 10:17:42,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:42,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 10:17:42,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:17:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:42,053 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:17:42,065 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:17:42,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:17:42,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:42,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 10:17:42,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186422006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486502551] [2025-03-04 10:17:42,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:17:42,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:42,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:42,127 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:17:42,128 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:17:42,167 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:17:42,180 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:17:42,180 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:17:42,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:42,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:17:42,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:42,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:42,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486502551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:42,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:42,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-04 10:17:42,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945554174] [2025-03-04 10:17:42,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:42,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:17:42,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:42,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:17:42,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:17:42,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:17:42,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 586 flow. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:17:42,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:42,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:17:42,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:42,518 INFO L124 PetriNetUnfolderBase]: 619/1135 cut-off events. [2025-03-04 10:17:42,519 INFO L125 PetriNetUnfolderBase]: For 4230/4230 co-relation queries the response was YES. [2025-03-04 10:17:42,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4927 conditions, 1135 events. 619/1135 cut-off events. For 4230/4230 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5569 event pairs, 201 based on Foata normal form. 40/1175 useless extension candidates. Maximal degree in co-relation 3369. Up to 624 conditions per place. [2025-03-04 10:17:42,526 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 83 selfloop transitions, 36 changer transitions 5/125 dead transitions. [2025-03-04 10:17:42,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 125 transitions, 1277 flow [2025-03-04 10:17:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:17:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:17:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2025-03-04 10:17:42,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6006006006006006 [2025-03-04 10:17:42,528 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 586 flow. Second operand 9 states and 200 transitions. [2025-03-04 10:17:42,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 125 transitions, 1277 flow [2025-03-04 10:17:42,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 1251 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:42,537 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 895 flow [2025-03-04 10:17:42,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=895, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2025-03-04 10:17:42,537 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2025-03-04 10:17:42,537 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 895 flow [2025-03-04 10:17:42,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:17:42,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:42,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:42,543 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:17:42,738 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:17:42,738 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:42,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:42,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1146851647, now seen corresponding path program 5 times [2025-03-04 10:17:42,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:42,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342516191] [2025-03-04 10:17:42,739 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:17:42,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:42,744 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:17:42,749 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:17:42,749 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:17:42,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:42,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:42,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342516191] [2025-03-04 10:17:42,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342516191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:42,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:42,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:17:42,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313408396] [2025-03-04 10:17:42,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:42,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:42,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:42,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:42,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:17:42,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:17:42,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 895 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:42,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:42,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:17:42,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:42,969 INFO L124 PetriNetUnfolderBase]: 597/1057 cut-off events. [2025-03-04 10:17:42,969 INFO L125 PetriNetUnfolderBase]: For 6860/6860 co-relation queries the response was YES. [2025-03-04 10:17:42,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5550 conditions, 1057 events. 597/1057 cut-off events. For 6860/6860 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4980 event pairs, 146 based on Foata normal form. 4/1061 useless extension candidates. Maximal degree in co-relation 4714. Up to 486 conditions per place. [2025-03-04 10:17:42,980 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 80 selfloop transitions, 22 changer transitions 8/111 dead transitions. [2025-03-04 10:17:42,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 111 transitions, 1392 flow [2025-03-04 10:17:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:17:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:17:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-04 10:17:42,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990990990990991 [2025-03-04 10:17:42,981 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 895 flow. Second operand 6 states and 133 transitions. [2025-03-04 10:17:42,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 111 transitions, 1392 flow [2025-03-04 10:17:42,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 111 transitions, 1328 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-03-04 10:17:42,993 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 954 flow [2025-03-04 10:17:42,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=954, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2025-03-04 10:17:42,993 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2025-03-04 10:17:42,993 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 954 flow [2025-03-04 10:17:42,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:42,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:42,993 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] [2025-03-04 10:17:42,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:17:42,994 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:42,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:42,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1887130950, now seen corresponding path program 1 times [2025-03-04 10:17:42,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:42,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746979756] [2025-03-04 10:17:42,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:42,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:17:43,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:17:43,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:43,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:43,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:43,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746979756] [2025-03-04 10:17:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746979756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:43,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:17:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729027045] [2025-03-04 10:17:43,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:43,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:17:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:43,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:17:43,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:17:43,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:17:43,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 954 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:17:43,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:43,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:17:43,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:43,154 INFO L124 PetriNetUnfolderBase]: 609/1053 cut-off events. [2025-03-04 10:17:43,154 INFO L125 PetriNetUnfolderBase]: For 7557/7557 co-relation queries the response was YES. [2025-03-04 10:17:43,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 1053 events. 609/1053 cut-off events. For 7557/7557 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4680 event pairs, 106 based on Foata normal form. 24/1077 useless extension candidates. Maximal degree in co-relation 5131. Up to 796 conditions per place. [2025-03-04 10:17:43,162 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 86 selfloop transitions, 12 changer transitions 2/101 dead transitions. [2025-03-04 10:17:43,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 1347 flow [2025-03-04 10:17:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:17:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:17:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-03-04 10:17:43,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6418918918918919 [2025-03-04 10:17:43,163 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 954 flow. Second operand 4 states and 95 transitions. [2025-03-04 10:17:43,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 1347 flow [2025-03-04 10:17:43,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 101 transitions, 1331 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:43,176 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 1031 flow [2025-03-04 10:17:43,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1031, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-03-04 10:17:43,176 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2025-03-04 10:17:43,176 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 1031 flow [2025-03-04 10:17:43,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:17:43,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:43,177 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:17:43,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:17:43,177 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:43,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1842440851, now seen corresponding path program 1 times [2025-03-04 10:17:43,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:43,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339174076] [2025-03-04 10:17:43,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:43,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:43,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:17:43,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:17:43,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:43,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:43,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339174076] [2025-03-04 10:17:43,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339174076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608876748] [2025-03-04 10:17:43,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:43,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:43,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:43,500 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:17:43,502 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:17:43,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:17:43,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:17:43,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:43,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:43,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:17:43,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:43,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:17:43,740 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:17:43,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:43,832 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:17:43,832 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 19 treesize of output 7 [2025-03-04 10:17:43,980 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:17:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608876748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:43,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:43,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2025-03-04 10:17:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603081498] [2025-03-04 10:17:43,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:43,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:17:43,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:43,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:17:43,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:17:44,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:17:44,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 1031 flow. Second operand has 22 states, 22 states have (on average 16.681818181818183) internal successors, (367), 22 states have internal predecessors, (367), 0 states have call successors, (0), 0 states 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:17:44,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:44,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:17:44,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:47,289 INFO L124 PetriNetUnfolderBase]: 1125/1953 cut-off events. [2025-03-04 10:17:47,289 INFO L125 PetriNetUnfolderBase]: For 12448/12448 co-relation queries the response was YES. [2025-03-04 10:17:47,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10173 conditions, 1953 events. 1125/1953 cut-off events. For 12448/12448 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9902 event pairs, 83 based on Foata normal form. 9/1962 useless extension candidates. Maximal degree in co-relation 8593. Up to 405 conditions per place. [2025-03-04 10:17:47,300 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 132 selfloop transitions, 73 changer transitions 173/379 dead transitions. [2025-03-04 10:17:47,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 379 transitions, 4165 flow [2025-03-04 10:17:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 10:17:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-04 10:17:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 909 transitions. [2025-03-04 10:17:47,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583538083538083 [2025-03-04 10:17:47,303 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 1031 flow. Second operand 44 states and 909 transitions. [2025-03-04 10:17:47,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 379 transitions, 4165 flow [2025-03-04 10:17:47,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 379 transitions, 4149 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:47,324 INFO L231 Difference]: Finished difference. Result has 139 places, 109 transitions, 1328 flow [2025-03-04 10:17:47,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1328, PETRI_PLACES=139, PETRI_TRANSITIONS=109} [2025-03-04 10:17:47,325 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 101 predicate places. [2025-03-04 10:17:47,325 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 109 transitions, 1328 flow [2025-03-04 10:17:47,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 16.681818181818183) internal successors, (367), 22 states have internal predecessors, (367), 0 states have call successors, (0), 0 states 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:17:47,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:47,325 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:47,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:17:47,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:47,530 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:47,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1891916318, now seen corresponding path program 2 times [2025-03-04 10:17:47,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319176392] [2025-03-04 10:17:47,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:47,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:17:47,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:17:47,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:17:47,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:17:47,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:47,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319176392] [2025-03-04 10:17:47,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319176392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:47,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646812706] [2025-03-04 10:17:47,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:47,861 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:17:47,862 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:17:47,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:17:47,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:17:47,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:17:47,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:47,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:17:47,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:47,980 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 19 treesize of output 1 [2025-03-04 10:17:48,117 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-04 10:17:48,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 40 [2025-03-04 10:17:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:48,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:48,404 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 170 treesize of output 150 [2025-03-04 10:17:48,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:17:48,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 572 treesize of output 488 [2025-03-04 10:18:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:20,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646812706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:20,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:20,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 22 [2025-03-04 10:18:20,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630937135] [2025-03-04 10:18:20,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:20,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:18:20,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:20,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:18:20,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:18:21,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:18:21,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 109 transitions, 1328 flow. Second operand has 22 states, 22 states have (on average 17.045454545454547) internal successors, (375), 22 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:18:21,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:21,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:18:21,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:22,651 INFO L124 PetriNetUnfolderBase]: 1291/2280 cut-off events. [2025-03-04 10:18:22,652 INFO L125 PetriNetUnfolderBase]: For 20793/20793 co-relation queries the response was YES. [2025-03-04 10:18:22,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13452 conditions, 2280 events. 1291/2280 cut-off events. For 20793/20793 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12142 event pairs, 21 based on Foata normal form. 38/2318 useless extension candidates. Maximal degree in co-relation 13409. Up to 499 conditions per place. [2025-03-04 10:18:22,667 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 212 selfloop transitions, 151 changer transitions 34/398 dead transitions. [2025-03-04 10:18:22,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 398 transitions, 4996 flow [2025-03-04 10:18:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 10:18:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-04 10:18:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 782 transitions. [2025-03-04 10:18:22,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5561877667140825 [2025-03-04 10:18:22,673 INFO L175 Difference]: Start difference. First operand has 139 places, 109 transitions, 1328 flow. Second operand 38 states and 782 transitions. [2025-03-04 10:18:22,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 398 transitions, 4996 flow [2025-03-04 10:18:22,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 398 transitions, 4372 flow, removed 251 selfloop flow, removed 22 redundant places. [2025-03-04 10:18:22,720 INFO L231 Difference]: Finished difference. Result has 146 places, 209 transitions, 2593 flow [2025-03-04 10:18:22,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2593, PETRI_PLACES=146, PETRI_TRANSITIONS=209} [2025-03-04 10:18:22,721 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 108 predicate places. [2025-03-04 10:18:22,721 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 209 transitions, 2593 flow [2025-03-04 10:18:22,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 17.045454545454547) internal successors, (375), 22 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:18:22,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:22,721 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:22,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:18:22,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:18:22,925 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2089084020, now seen corresponding path program 3 times [2025-03-04 10:18:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126435571] [2025-03-04 10:18:22,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:22,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-04 10:18:22,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 24 statements. [2025-03-04 10:18:22,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:22,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:23,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126435571] [2025-03-04 10:18:23,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126435571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:23,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:23,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110449555] [2025-03-04 10:18:23,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:23,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:23,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:23,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:18:23,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 209 transitions, 2593 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:23,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:23,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:18:23,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:23,263 INFO L124 PetriNetUnfolderBase]: 1179/2043 cut-off events. [2025-03-04 10:18:23,263 INFO L125 PetriNetUnfolderBase]: For 27003/27003 co-relation queries the response was YES. [2025-03-04 10:18:23,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12924 conditions, 2043 events. 1179/2043 cut-off events. For 27003/27003 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10284 event pairs, 444 based on Foata normal form. 34/2077 useless extension candidates. Maximal degree in co-relation 12878. Up to 1433 conditions per place. [2025-03-04 10:18:23,276 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 166 selfloop transitions, 48 changer transitions 0/215 dead transitions. [2025-03-04 10:18:23,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 215 transitions, 2977 flow [2025-03-04 10:18:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-04 10:18:23,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2025-03-04 10:18:23,277 INFO L175 Difference]: Start difference. First operand has 146 places, 209 transitions, 2593 flow. Second operand 6 states and 138 transitions. [2025-03-04 10:18:23,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 215 transitions, 2977 flow [2025-03-04 10:18:23,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 215 transitions, 2769 flow, removed 91 selfloop flow, removed 11 redundant places. [2025-03-04 10:18:23,327 INFO L231 Difference]: Finished difference. Result has 128 places, 191 transitions, 2254 flow [2025-03-04 10:18:23,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2254, PETRI_PLACES=128, PETRI_TRANSITIONS=191} [2025-03-04 10:18:23,328 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2025-03-04 10:18:23,328 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 191 transitions, 2254 flow [2025-03-04 10:18:23,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:23,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:23,329 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:23,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:18:23,329 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:23,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:23,329 INFO L85 PathProgramCache]: Analyzing trace with hash 368922231, now seen corresponding path program 4 times [2025-03-04 10:18:23,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:23,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281603050] [2025-03-04 10:18:23,329 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:23,334 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:18:23,342 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:23,342 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:23,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:23,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:23,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281603050] [2025-03-04 10:18:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281603050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572450150] [2025-03-04 10:18:23,474 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:23,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:23,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:23,476 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:18:23,478 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:18:23,516 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:18:23,566 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:23,566 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:23,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:23,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:18:23,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:23,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572450150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:26,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:26,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 13] total 23 [2025-03-04 10:18:26,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33834244] [2025-03-04 10:18:26,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:26,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:18:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:26,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:18:26,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:18:26,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 10:18:26,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 191 transitions, 2254 flow. Second operand has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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:18:26,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:26,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 10:18:26,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:02,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []