./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/unroll-5.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 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:30:28,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:30:28,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:30:28,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:30:28,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:30:28,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:30:28,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:30:28,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:30:28,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:30:28,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:30:28,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:30:28,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:30:28,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:30:28,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:30:28,754 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:30:28,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:30:28,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:30:28,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:30:28,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:30:28,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:30:28,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:30:28,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:30:28,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:30:28,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:28,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:30:28,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:30:28,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:30:28,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:30:28,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:30:28,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:30:28,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:30:28,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:30:28,756 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 -> 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 [2025-03-09 01:30:28,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:30:28,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:30:28,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:30:28,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:30:28,987 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:30:28,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-03-09 01:30:30,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fc9f697/c3a62f99ff164b15b5c3bee4e068043d/FLAG77a3d4bd2 [2025-03-09 01:30:30,314 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:30:30,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-03-09 01:30:30,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fc9f697/c3a62f99ff164b15b5c3bee4e068043d/FLAG77a3d4bd2 [2025-03-09 01:30:30,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fc9f697/c3a62f99ff164b15b5c3bee4e068043d [2025-03-09 01:30:30,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:30:30,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:30:30,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:30,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:30:30,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:30:30,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10869dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30, skipping insertion in model container [2025-03-09 01:30:30,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:30:30,490 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:30:30,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:30,501 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:30:30,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:30,535 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:30:30,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30 WrapperNode [2025-03-09 01:30:30,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:30,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:30,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:30:30,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:30:30,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,559 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 150 [2025-03-09 01:30:30,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:30,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:30:30,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:30:30,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:30:30,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,584 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:30:30,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,589 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:30:30,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:30:30,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:30:30,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:30:30,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (1/1) ... [2025-03-09 01:30:30,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:30,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:30,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:30:30,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:30:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:30:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:30:30,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:30:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:30:30,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:30:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:30:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:30:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:30:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:30:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:30:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:30:30,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:30:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:30:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:30:30,637 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:30:30,703 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:30:30,705 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:30:31,014 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:30:31,014 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:30:31,189 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:30:31,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:30:31,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:31 BoogieIcfgContainer [2025-03-09 01:30:31,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:30:31,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:30:31,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:30:31,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:30:31,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:30:30" (1/3) ... [2025-03-09 01:30:31,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d61d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:31, skipping insertion in model container [2025-03-09 01:30:31,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:30" (2/3) ... [2025-03-09 01:30:31,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d61d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:31, skipping insertion in model container [2025-03-09 01:30:31,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:31" (3/3) ... [2025-03-09 01:30:31,200 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2025-03-09 01:30:31,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:30:31,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-5.wvr.c that has 3 procedures, 41 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-09 01:30:31,217 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:30:31,279 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:30:31,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 100 flow [2025-03-09 01:30:31,356 INFO L124 PetriNetUnfolderBase]: 3/41 cut-off events. [2025-03-09 01:30:31,357 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:30:31,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 3/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-09 01:30:31,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 100 flow [2025-03-09 01:30:31,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 40 transitions, 92 flow [2025-03-09 01:30:31,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:30:31,381 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;@3782545c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:30:31,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-09 01:30:31,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:30:31,387 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:30:31,387 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:30:31,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:31,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:31,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:31,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash 451936, now seen corresponding path program 1 times [2025-03-09 01:30:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:31,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485644242] [2025-03-09 01:30:31,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:31,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:31,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:31,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:31,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:31,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485644242] [2025-03-09 01:30:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485644242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:31,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:30:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152526093] [2025-03-09 01:30:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:31,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:31,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:31,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:31,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:31,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-09 01:30:31,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:31,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:31,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-09 01:30:31,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:31,760 INFO L124 PetriNetUnfolderBase]: 114/291 cut-off events. [2025-03-09 01:30:31,760 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-09 01:30:31,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 291 events. 114/291 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1355 event pairs, 86 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 444. Up to 197 conditions per place. [2025-03-09 01:30:31,765 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 21 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-09 01:30:31,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 132 flow [2025-03-09 01:30:31,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-09 01:30:31,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5891472868217055 [2025-03-09 01:30:31,778 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 92 flow. Second operand 3 states and 76 transitions. [2025-03-09 01:30:31,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 132 flow [2025-03-09 01:30:31,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:31,783 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 82 flow [2025-03-09 01:30:31,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-09 01:30:31,786 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-03-09 01:30:31,787 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 82 flow [2025-03-09 01:30:31,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:31,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:31,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:31,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:30:31,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:31,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 451937, now seen corresponding path program 1 times [2025-03-09 01:30:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:31,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460660785] [2025-03-09 01:30:31,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:31,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:31,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:31,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:31,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460660785] [2025-03-09 01:30:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460660785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:32,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747714198] [2025-03-09 01:30:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:32,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:32,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:32,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:32,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-09 01:30:32,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:32,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:32,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-09 01:30:32,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:32,189 INFO L124 PetriNetUnfolderBase]: 115/294 cut-off events. [2025-03-09 01:30:32,189 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:30:32,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 294 events. 115/294 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1362 event pairs, 86 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 486. Up to 202 conditions per place. [2025-03-09 01:30:32,191 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 24 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-03-09 01:30:32,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 144 flow [2025-03-09 01:30:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-09 01:30:32,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2025-03-09 01:30:32,192 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 82 flow. Second operand 3 states and 79 transitions. [2025-03-09 01:30:32,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 144 flow [2025-03-09 01:30:32,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:32,193 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 97 flow [2025-03-09 01:30:32,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-03-09 01:30:32,194 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-03-09 01:30:32,194 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 97 flow [2025-03-09 01:30:32,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:32,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:32,194 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:30:32,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:30:32,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:32,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash 434326139, now seen corresponding path program 1 times [2025-03-09 01:30:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:32,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670858777] [2025-03-09 01:30:32,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:32,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:32,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:32,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:32,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:32,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670858777] [2025-03-09 01:30:32,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670858777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:32,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134880998] [2025-03-09 01:30:32,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:32,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:32,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:32,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:32,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:30:32,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:32,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:32,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:32,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:32,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:30:32,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:32,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:30:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:32,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:32,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134880998] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:32,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:32,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:32,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444689701] [2025-03-09 01:30:32,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:32,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:32,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:32,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:32,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:32,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-09 01:30:32,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 97 flow. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:32,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:32,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-09 01:30:32,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:33,135 INFO L124 PetriNetUnfolderBase]: 115/293 cut-off events. [2025-03-09 01:30:33,135 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:30:33,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 293 events. 115/293 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1357 event pairs, 86 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 486. Up to 198 conditions per place. [2025-03-09 01:30:33,137 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 20 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2025-03-09 01:30:33,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 147 flow [2025-03-09 01:30:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-03-09 01:30:33,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5209302325581395 [2025-03-09 01:30:33,138 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 97 flow. Second operand 5 states and 112 transitions. [2025-03-09 01:30:33,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 147 flow [2025-03-09 01:30:33,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:33,139 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 110 flow [2025-03-09 01:30:33,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-03-09 01:30:33,140 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-03-09 01:30:33,140 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 110 flow [2025-03-09 01:30:33,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:33,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:33,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:30:33,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:30:33,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:33,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:33,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 581700652, now seen corresponding path program 1 times [2025-03-09 01:30:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:33,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017039007] [2025-03-09 01:30:33,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:33,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:33,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:30:33,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:30:33,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:33,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:33,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:33,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017039007] [2025-03-09 01:30:33,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017039007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:33,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:33,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461246197] [2025-03-09 01:30:33,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:33,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:33,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:33,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:33,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-09 01:30:33,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:33,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:33,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-09 01:30:33,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:33,492 INFO L124 PetriNetUnfolderBase]: 115/248 cut-off events. [2025-03-09 01:30:33,492 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:30:33,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 248 events. 115/248 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 919 event pairs, 86 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 449. Up to 197 conditions per place. [2025-03-09 01:30:33,493 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-09 01:30:33,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 150 flow [2025-03-09 01:30:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-03-09 01:30:33,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42441860465116277 [2025-03-09 01:30:33,495 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 110 flow. Second operand 4 states and 73 transitions. [2025-03-09 01:30:33,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 150 flow [2025-03-09 01:30:33,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 137 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:33,496 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 91 flow [2025-03-09 01:30:33,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-03-09 01:30:33,496 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2025-03-09 01:30:33,496 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 91 flow [2025-03-09 01:30:33,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:33,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:33,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:30:33,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:30:33,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:33,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash 581700653, now seen corresponding path program 1 times [2025-03-09 01:30:33,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:33,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204291142] [2025-03-09 01:30:33,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:33,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:30:33,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:30:33,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:33,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204291142] [2025-03-09 01:30:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204291142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:33,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:33,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:33,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020658070] [2025-03-09 01:30:33,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:33,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:33,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:33,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:33,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:33,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:33,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:33,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:33,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:33,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:33,598 INFO L124 PetriNetUnfolderBase]: 114/247 cut-off events. [2025-03-09 01:30:33,598 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:30:33,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 247 events. 114/247 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 910 event pairs, 86 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 441. Up to 200 conditions per place. [2025-03-09 01:30:33,600 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-03-09 01:30:33,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 136 flow [2025-03-09 01:30:33,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-09 01:30:33,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2025-03-09 01:30:33,602 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 91 flow. Second operand 3 states and 80 transitions. [2025-03-09 01:30:33,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 136 flow [2025-03-09 01:30:33,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:33,603 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 87 flow [2025-03-09 01:30:33,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-09 01:30:33,603 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2025-03-09 01:30:33,603 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 87 flow [2025-03-09 01:30:33,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:33,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:33,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:33,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:30:33,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:33,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1723508525, now seen corresponding path program 1 times [2025-03-09 01:30:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:33,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107848036] [2025-03-09 01:30:33,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:33,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:33,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:33,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:33,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:33,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:33,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107848036] [2025-03-09 01:30:33,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107848036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:33,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265756871] [2025-03-09 01:30:33,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:33,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:33,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:33,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:33,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:30:33,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:33,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:33,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:33,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:33,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:30:33,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:33,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:30:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:33,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265756871] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:33,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:33,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 9 [2025-03-09 01:30:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65233557] [2025-03-09 01:30:33,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:33,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:33,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:33,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:33,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:34,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-09 01:30:34,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:34,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:34,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-09 01:30:34,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:34,097 INFO L124 PetriNetUnfolderBase]: 226/440 cut-off events. [2025-03-09 01:30:34,098 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:30:34,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 440 events. 226/440 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1908 event pairs, 86 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 843. Up to 213 conditions per place. [2025-03-09 01:30:34,101 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 40 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-03-09 01:30:34,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 210 flow [2025-03-09 01:30:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-09 01:30:34,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-03-09 01:30:34,105 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 87 flow. Second operand 4 states and 110 transitions. [2025-03-09 01:30:34,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 210 flow [2025-03-09 01:30:34,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:34,107 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 97 flow [2025-03-09 01:30:34,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-03-09 01:30:34,107 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-03-09 01:30:34,108 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 97 flow [2025-03-09 01:30:34,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:34,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:34,109 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:34,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:30:34,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 01:30:34,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1565699094, now seen corresponding path program 1 times [2025-03-09 01:30:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:34,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029836372] [2025-03-09 01:30:34,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:34,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:34,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:34,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:34,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:34,467 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-09 01:30:34,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029836372] [2025-03-09 01:30:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029836372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587021072] [2025-03-09 01:30:34,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:34,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:34,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:34,470 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:34,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:30:34,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:34,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:34,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:34,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:34,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:34,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:34,633 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-09 01:30:34,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:34,693 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-09 01:30:34,849 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-09 01:30:34,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587021072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:34,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:34,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-09 01:30:34,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745175902] [2025-03-09 01:30:34,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:34,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:30:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:34,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:30:34,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:30:35,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-09 01:30:35,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 97 flow. Second operand has 17 states, 17 states have (on average 18.764705882352942) internal successors, (319), 17 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:35,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:35,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-09 01:30:35,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:35,575 INFO L124 PetriNetUnfolderBase]: 464/979 cut-off events. [2025-03-09 01:30:35,576 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-09 01:30:35,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 979 events. 464/979 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5438 event pairs, 243 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 982. Up to 393 conditions per place. [2025-03-09 01:30:35,580 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 69 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2025-03-09 01:30:35,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 86 transitions, 393 flow [2025-03-09 01:30:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2025-03-09 01:30:35,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-09 01:30:35,581 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 97 flow. Second operand 8 states and 215 transitions. [2025-03-09 01:30:35,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 86 transitions, 393 flow [2025-03-09 01:30:35,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 86 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:35,583 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 180 flow [2025-03-09 01:30:35,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=180, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-03-09 01:30:35,583 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-03-09 01:30:35,583 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 180 flow [2025-03-09 01:30:35,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.764705882352942) internal successors, (319), 17 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:35,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:35,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:35,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:35,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:35,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:35,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1530368121, now seen corresponding path program 1 times [2025-03-09 01:30:35,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:35,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879013759] [2025-03-09 01:30:35,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:35,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:35,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:35,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:35,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:35,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:35,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-09 01:30:35,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879013759] [2025-03-09 01:30:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879013759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398413769] [2025-03-09 01:30:35,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:35,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:35,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:35,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:35,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:30:35,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:35,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:35,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:35,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:35,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:35,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:36,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:36,099 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-09 01:30:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:36,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398413769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:36,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:36,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:36,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611557933] [2025-03-09 01:30:36,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:36,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:36,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:36,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:36,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-09 01:30:36,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 180 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-09 01:30:36,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:36,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-09 01:30:36,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:36,440 INFO L124 PetriNetUnfolderBase]: 767/1349 cut-off events. [2025-03-09 01:30:36,441 INFO L125 PetriNetUnfolderBase]: For 810/858 co-relation queries the response was YES. [2025-03-09 01:30:36,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 1349 events. 767/1349 cut-off events. For 810/858 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6329 event pairs, 162 based on Foata normal form. 32/1189 useless extension candidates. Maximal degree in co-relation 2075. Up to 977 conditions per place. [2025-03-09 01:30:36,447 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 47 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2025-03-09 01:30:36,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 338 flow [2025-03-09 01:30:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-09 01:30:36,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49767441860465117 [2025-03-09 01:30:36,449 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 180 flow. Second operand 5 states and 107 transitions. [2025-03-09 01:30:36,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 338 flow [2025-03-09 01:30:36,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:36,453 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 202 flow [2025-03-09 01:30:36,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2025-03-09 01:30:36,454 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2025-03-09 01:30:36,455 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 202 flow [2025-03-09 01:30:36,455 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-09 01:30:36,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:36,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:36,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:30:36,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:36,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:36,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash 196771987, now seen corresponding path program 1 times [2025-03-09 01:30:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:36,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361625962] [2025-03-09 01:30:36,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:36,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:30:36,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:30:36,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:36,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:36,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:36,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361625962] [2025-03-09 01:30:36,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361625962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:36,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656456700] [2025-03-09 01:30:36,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:36,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:36,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:36,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:36,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:30:36,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:30:36,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:30:36,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:36,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:36,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:36,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:36,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:36,923 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-09 01:30:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656456700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:37,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:37,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-09 01:30:37,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714065761] [2025-03-09 01:30:37,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:37,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:30:37,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:37,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:30:37,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:30:37,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-09 01:30:37,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 202 flow. Second operand has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:37,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:37,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-09 01:30:37,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:37,535 INFO L124 PetriNetUnfolderBase]: 859/1498 cut-off events. [2025-03-09 01:30:37,536 INFO L125 PetriNetUnfolderBase]: For 999/1057 co-relation queries the response was YES. [2025-03-09 01:30:37,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3831 conditions, 1498 events. 859/1498 cut-off events. For 999/1057 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6982 event pairs, 395 based on Foata normal form. 0/1306 useless extension candidates. Maximal degree in co-relation 2242. Up to 1153 conditions per place. [2025-03-09 01:30:37,541 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 64 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2025-03-09 01:30:37,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 446 flow [2025-03-09 01:30:37,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-03-09 01:30:37,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2025-03-09 01:30:37,542 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 202 flow. Second operand 7 states and 161 transitions. [2025-03-09 01:30:37,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 446 flow [2025-03-09 01:30:37,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 435 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:37,545 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 225 flow [2025-03-09 01:30:37,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-03-09 01:30:37,546 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2025-03-09 01:30:37,546 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 225 flow [2025-03-09 01:30:37,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:37,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:37,546 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:37,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:37,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:37,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:37,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash 394868156, now seen corresponding path program 2 times [2025-03-09 01:30:37,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:37,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476589014] [2025-03-09 01:30:37,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:37,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:30:37,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:30:37,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:37,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:37,869 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-09 01:30:37,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:37,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476589014] [2025-03-09 01:30:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476589014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185981085] [2025-03-09 01:30:37,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:37,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:37,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:37,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:37,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:30:37,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:30:37,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:30:37,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:37,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:37,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:30:37,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:37,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:30:38,043 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-09 01:30:38,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:38,157 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-09 01:30:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185981085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:38,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:38,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:38,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30399637] [2025-03-09 01:30:38,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:38,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:38,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:38,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:38,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-09 01:30:38,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 225 flow. Second operand has 11 states, 11 states have (on average 19.727272727272727) internal successors, (217), 11 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:38,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:38,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-09 01:30:38,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:38,549 INFO L124 PetriNetUnfolderBase]: 629/1225 cut-off events. [2025-03-09 01:30:38,549 INFO L125 PetriNetUnfolderBase]: For 518/518 co-relation queries the response was YES. [2025-03-09 01:30:38,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3124 conditions, 1225 events. 629/1225 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6431 event pairs, 362 based on Foata normal form. 0/1161 useless extension candidates. Maximal degree in co-relation 1884. Up to 814 conditions per place. [2025-03-09 01:30:38,555 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 40 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2025-03-09 01:30:38,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 368 flow [2025-03-09 01:30:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-03-09 01:30:38,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-03-09 01:30:38,556 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 225 flow. Second operand 5 states and 120 transitions. [2025-03-09 01:30:38,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 368 flow [2025-03-09 01:30:38,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 351 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:38,558 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 224 flow [2025-03-09 01:30:38,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-03-09 01:30:38,559 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2025-03-09 01:30:38,559 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 224 flow [2025-03-09 01:30:38,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.727272727272727) internal successors, (217), 11 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:38,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:38,559 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:38,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:38,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:38,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:38,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1739248723, now seen corresponding path program 2 times [2025-03-09 01:30:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:38,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299007680] [2025-03-09 01:30:38,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:38,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:30:38,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-09 01:30:38,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:38,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:38,926 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-09 01:30:38,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:38,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299007680] [2025-03-09 01:30:38,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299007680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:38,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:38,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:30:38,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353568675] [2025-03-09 01:30:38,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:38,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:38,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:38,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:38,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-09 01:30:38,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:38,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:38,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-09 01:30:38,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:39,123 INFO L124 PetriNetUnfolderBase]: 675/1183 cut-off events. [2025-03-09 01:30:39,124 INFO L125 PetriNetUnfolderBase]: For 1459/1459 co-relation queries the response was YES. [2025-03-09 01:30:39,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1183 events. 675/1183 cut-off events. For 1459/1459 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5238 event pairs, 322 based on Foata normal form. 96/1183 useless extension candidates. Maximal degree in co-relation 1927. Up to 684 conditions per place. [2025-03-09 01:30:39,129 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 39 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2025-03-09 01:30:39,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 361 flow [2025-03-09 01:30:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-03-09 01:30:39,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4604651162790698 [2025-03-09 01:30:39,130 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 224 flow. Second operand 5 states and 99 transitions. [2025-03-09 01:30:39,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 361 flow [2025-03-09 01:30:39,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:39,132 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 204 flow [2025-03-09 01:30:39,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-03-09 01:30:39,134 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2025-03-09 01:30:39,134 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 204 flow [2025-03-09 01:30:39,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:39,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:39,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:39,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:30:39,134 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:39,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash -916332715, now seen corresponding path program 1 times [2025-03-09 01:30:39,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:39,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143571017] [2025-03-09 01:30:39,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:39,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:39,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:30:39,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:30:39,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:39,163 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-09 01:30:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143571017] [2025-03-09 01:30:39,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143571017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:39,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:39,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857665770] [2025-03-09 01:30:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:39,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:39,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:39,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:39,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:39,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:39,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:39,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:39,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:39,276 INFO L124 PetriNetUnfolderBase]: 629/1133 cut-off events. [2025-03-09 01:30:39,276 INFO L125 PetriNetUnfolderBase]: For 933/933 co-relation queries the response was YES. [2025-03-09 01:30:39,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3035 conditions, 1133 events. 629/1133 cut-off events. For 933/933 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5135 event pairs, 174 based on Foata normal form. 2/1071 useless extension candidates. Maximal degree in co-relation 1810. Up to 913 conditions per place. [2025-03-09 01:30:39,280 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 43 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2025-03-09 01:30:39,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 343 flow [2025-03-09 01:30:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-09 01:30:39,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2025-03-09 01:30:39,281 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 204 flow. Second operand 3 states and 91 transitions. [2025-03-09 01:30:39,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 343 flow [2025-03-09 01:30:39,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 325 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:39,284 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 221 flow [2025-03-09 01:30:39,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-09 01:30:39,286 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2025-03-09 01:30:39,286 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 221 flow [2025-03-09 01:30:39,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:39,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:39,287 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:39,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:30:39,287 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:39,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:39,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1143518206, now seen corresponding path program 1 times [2025-03-09 01:30:39,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:39,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050834049] [2025-03-09 01:30:39,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:39,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:39,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:30:39,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:30:39,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:39,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:39,426 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-09 01:30:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050834049] [2025-03-09 01:30:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050834049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182109695] [2025-03-09 01:30:39,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:39,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:39,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:39,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:30:39,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:30:39,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:30:39,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:39,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:39,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:39,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:39,604 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-09 01:30:39,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:39,672 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-09 01:30:39,806 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-09 01:30:39,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182109695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:39,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:39,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-09 01:30:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621263279] [2025-03-09 01:30:39,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:39,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:30:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:39,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:30:39,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:30:40,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-09 01:30:40,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 221 flow. Second operand has 17 states, 17 states have (on average 15.823529411764707) internal successors, (269), 17 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:40,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:40,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-09 01:30:40,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:40,270 INFO L124 PetriNetUnfolderBase]: 652/1140 cut-off events. [2025-03-09 01:30:40,270 INFO L125 PetriNetUnfolderBase]: For 984/984 co-relation queries the response was YES. [2025-03-09 01:30:40,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 1140 events. 652/1140 cut-off events. For 984/984 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4954 event pairs, 320 based on Foata normal form. 0/1060 useless extension candidates. Maximal degree in co-relation 1887. Up to 508 conditions per place. [2025-03-09 01:30:40,275 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 69 selfloop transitions, 11 changer transitions 1/82 dead transitions. [2025-03-09 01:30:40,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 512 flow [2025-03-09 01:30:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2025-03-09 01:30:40,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2025-03-09 01:30:40,277 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 221 flow. Second operand 8 states and 176 transitions. [2025-03-09 01:30:40,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 512 flow [2025-03-09 01:30:40,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 503 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:40,280 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 256 flow [2025-03-09 01:30:40,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2025-03-09 01:30:40,280 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2025-03-09 01:30:40,280 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 256 flow [2025-03-09 01:30:40,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.823529411764707) internal successors, (269), 17 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:40,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:40,281 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:40,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:30:40,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:40,482 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:40,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash -124944088, now seen corresponding path program 2 times [2025-03-09 01:30:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904958810] [2025-03-09 01:30:40,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:40,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:40,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 18 statements. [2025-03-09 01:30:40,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:40,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,595 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-09 01:30:40,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:40,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904958810] [2025-03-09 01:30:40,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904958810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:40,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292103059] [2025-03-09 01:30:40,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:40,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:40,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:40,598 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:40,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:30:40,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:40,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 18 statements. [2025-03-09 01:30:40,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:40,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:30:40,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:40,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:30:40,816 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-09 01:30:40,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:40,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-09 01:30:40,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292103059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:40,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-09 01:30:40,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937569648] [2025-03-09 01:30:40,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:40,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:30:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:40,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:30:40,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:30:41,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-09 01:30:41,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 256 flow. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:41,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:41,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-09 01:30:41,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:41,284 INFO L124 PetriNetUnfolderBase]: 629/1101 cut-off events. [2025-03-09 01:30:41,285 INFO L125 PetriNetUnfolderBase]: For 1313/1313 co-relation queries the response was YES. [2025-03-09 01:30:41,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 1101 events. 629/1101 cut-off events. For 1313/1313 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4749 event pairs, 196 based on Foata normal form. 16/1117 useless extension candidates. Maximal degree in co-relation 1854. Up to 640 conditions per place. [2025-03-09 01:30:41,288 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 44 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2025-03-09 01:30:41,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 426 flow [2025-03-09 01:30:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-09 01:30:41,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2025-03-09 01:30:41,289 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 256 flow. Second operand 5 states and 95 transitions. [2025-03-09 01:30:41,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 426 flow [2025-03-09 01:30:41,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 409 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:41,291 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 250 flow [2025-03-09 01:30:41,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2025-03-09 01:30:41,292 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2025-03-09 01:30:41,292 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 250 flow [2025-03-09 01:30:41,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:41,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:41,292 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-09 01:30:41,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:41,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:30:41,493 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:41,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash -628786694, now seen corresponding path program 1 times [2025-03-09 01:30:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:41,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017682920] [2025-03-09 01:30:41,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:41,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:41,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:30:41,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:41,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:41,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:41,561 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-09 01:30:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:41,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017682920] [2025-03-09 01:30:41,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017682920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:41,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:41,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:30:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305148426] [2025-03-09 01:30:41,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:41,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:30:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:41,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:30:41,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:30:41,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:41,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:41,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:41,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:41,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:41,741 INFO L124 PetriNetUnfolderBase]: 641/1149 cut-off events. [2025-03-09 01:30:41,742 INFO L125 PetriNetUnfolderBase]: For 1438/1438 co-relation queries the response was YES. [2025-03-09 01:30:41,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3442 conditions, 1149 events. 641/1149 cut-off events. For 1438/1438 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5330 event pairs, 94 based on Foata normal form. 58/1207 useless extension candidates. Maximal degree in co-relation 2114. Up to 594 conditions per place. [2025-03-09 01:30:41,747 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 75 selfloop transitions, 16 changer transitions 1/93 dead transitions. [2025-03-09 01:30:41,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 674 flow [2025-03-09 01:30:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2025-03-09 01:30:41,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-03-09 01:30:41,748 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 250 flow. Second operand 7 states and 196 transitions. [2025-03-09 01:30:41,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 674 flow [2025-03-09 01:30:41,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 640 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:41,751 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 388 flow [2025-03-09 01:30:41,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2025-03-09 01:30:41,751 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2025-03-09 01:30:41,751 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 388 flow [2025-03-09 01:30:41,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:41,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:41,752 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-09 01:30:41,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:30:41,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:41,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash 777811140, now seen corresponding path program 2 times [2025-03-09 01:30:41,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:41,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149433775] [2025-03-09 01:30:41,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:41,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:41,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:41,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:41,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:41,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:41,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:41,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149433775] [2025-03-09 01:30:41,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149433775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:41,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015220427] [2025-03-09 01:30:41,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:41,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:41,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:41,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:41,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:30:41,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:41,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:41,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:41,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:41,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:30:41,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:42,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:30:42,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015220427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:42,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:30:42,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2025-03-09 01:30:42,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723291043] [2025-03-09 01:30:42,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:42,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:42,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:42,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:42,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:42,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:42,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 388 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:42,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:42,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:42,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:42,179 INFO L124 PetriNetUnfolderBase]: 633/1153 cut-off events. [2025-03-09 01:30:42,179 INFO L125 PetriNetUnfolderBase]: For 2851/2851 co-relation queries the response was YES. [2025-03-09 01:30:42,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4118 conditions, 1153 events. 633/1153 cut-off events. For 2851/2851 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5373 event pairs, 271 based on Foata normal form. 12/1165 useless extension candidates. Maximal degree in co-relation 2663. Up to 838 conditions per place. [2025-03-09 01:30:42,185 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 64 selfloop transitions, 10 changer transitions 5/80 dead transitions. [2025-03-09 01:30:42,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 80 transitions, 723 flow [2025-03-09 01:30:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-09 01:30:42,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-09 01:30:42,186 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 388 flow. Second operand 5 states and 135 transitions. [2025-03-09 01:30:42,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 80 transitions, 723 flow [2025-03-09 01:30:42,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 80 transitions, 701 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:42,191 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 421 flow [2025-03-09 01:30:42,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2025-03-09 01:30:42,191 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2025-03-09 01:30:42,192 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 421 flow [2025-03-09 01:30:42,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:42,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:42,192 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-09 01:30:42,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:30:42,392 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,SelfDestructingSolverStorable15 [2025-03-09 01:30:42,392 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:42,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 849194470, now seen corresponding path program 3 times [2025-03-09 01:30:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080796613] [2025-03-09 01:30:42,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:42,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:42,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:42,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:42,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:42,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080796613] [2025-03-09 01:30:42,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080796613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:42,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896301244] [2025-03-09 01:30:42,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:42,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:42,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:42,551 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:42,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:30:42,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:42,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:42,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:42,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:42,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:30:42,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:42,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896301244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:42,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:42,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 12 [2025-03-09 01:30:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897792924] [2025-03-09 01:30:42,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:42,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:30:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:42,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:30:42,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:30:42,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:42,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 421 flow. Second operand has 12 states, 12 states have (on average 21.25) internal successors, (255), 12 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:42,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:42,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:42,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:43,301 INFO L124 PetriNetUnfolderBase]: 849/1531 cut-off events. [2025-03-09 01:30:43,301 INFO L125 PetriNetUnfolderBase]: For 4763/4763 co-relation queries the response was YES. [2025-03-09 01:30:43,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6061 conditions, 1531 events. 849/1531 cut-off events. For 4763/4763 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7736 event pairs, 192 based on Foata normal form. 18/1549 useless extension candidates. Maximal degree in co-relation 3750. Up to 582 conditions per place. [2025-03-09 01:30:43,311 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 78 selfloop transitions, 62 changer transitions 3/144 dead transitions. [2025-03-09 01:30:43,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 144 transitions, 1329 flow [2025-03-09 01:30:43,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:30:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:30:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 291 transitions. [2025-03-09 01:30:43,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6152219873150105 [2025-03-09 01:30:43,312 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 421 flow. Second operand 11 states and 291 transitions. [2025-03-09 01:30:43,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 144 transitions, 1329 flow [2025-03-09 01:30:43,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 144 transitions, 1283 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:43,322 INFO L231 Difference]: Finished difference. Result has 84 places, 93 transitions, 1001 flow [2025-03-09 01:30:43,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1001, PETRI_PLACES=84, PETRI_TRANSITIONS=93} [2025-03-09 01:30:43,322 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2025-03-09 01:30:43,322 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 93 transitions, 1001 flow [2025-03-09 01:30:43,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.25) internal successors, (255), 12 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:43,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:43,323 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-09 01:30:43,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:30:43,523 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,SelfDestructingSolverStorable16 [2025-03-09 01:30:43,523 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:43,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash -121705024, now seen corresponding path program 4 times [2025-03-09 01:30:43,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:43,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669067931] [2025-03-09 01:30:43,524 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:43,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:43,528 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:43,533 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:43,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:43,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:43,585 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-09 01:30:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:43,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669067931] [2025-03-09 01:30:43,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669067931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:43,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:43,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:43,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274393696] [2025-03-09 01:30:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:43,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:43,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:43,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:43,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:43,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:43,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 93 transitions, 1001 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:43,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:43,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:43,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:43,794 INFO L124 PetriNetUnfolderBase]: 849/1531 cut-off events. [2025-03-09 01:30:43,794 INFO L125 PetriNetUnfolderBase]: For 7942/7942 co-relation queries the response was YES. [2025-03-09 01:30:43,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 1531 events. 849/1531 cut-off events. For 7942/7942 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7741 event pairs, 298 based on Foata normal form. 4/1535 useless extension candidates. Maximal degree in co-relation 6177. Up to 988 conditions per place. [2025-03-09 01:30:43,808 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 87 selfloop transitions, 29 changer transitions 2/119 dead transitions. [2025-03-09 01:30:43,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 1461 flow [2025-03-09 01:30:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-03-09 01:30:43,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6465116279069767 [2025-03-09 01:30:43,809 INFO L175 Difference]: Start difference. First operand has 84 places, 93 transitions, 1001 flow. Second operand 5 states and 139 transitions. [2025-03-09 01:30:43,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 1461 flow [2025-03-09 01:30:43,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 1423 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:43,827 INFO L231 Difference]: Finished difference. Result has 89 places, 99 transitions, 1141 flow [2025-03-09 01:30:43,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1141, PETRI_PLACES=89, PETRI_TRANSITIONS=99} [2025-03-09 01:30:43,828 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places. [2025-03-09 01:30:43,828 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 99 transitions, 1141 flow [2025-03-09 01:30:43,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:43,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:43,828 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-09 01:30:43,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:30:43,828 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:43,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1839454084, now seen corresponding path program 5 times [2025-03-09 01:30:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:43,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810831994] [2025-03-09 01:30:43,829 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:43,834 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:43,841 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:43,844 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:43,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:43,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:43,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810831994] [2025-03-09 01:30:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810831994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:43,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888984045] [2025-03-09 01:30:43,906 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:43,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:43,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:43,908 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:43,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:30:43,943 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:43,956 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:43,956 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:43,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:43,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:30:43,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:43,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:44,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888984045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:44,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:44,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-09 01:30:44,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795483530] [2025-03-09 01:30:44,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:44,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:30:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:44,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:30:44,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:30:44,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:44,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 99 transitions, 1141 flow. Second operand has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:44,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:44,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:44,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:44,249 INFO L124 PetriNetUnfolderBase]: 891/1597 cut-off events. [2025-03-09 01:30:44,249 INFO L125 PetriNetUnfolderBase]: For 9820/9820 co-relation queries the response was YES. [2025-03-09 01:30:44,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8081 conditions, 1597 events. 891/1597 cut-off events. For 9820/9820 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8093 event pairs, 270 based on Foata normal form. 28/1625 useless extension candidates. Maximal degree in co-relation 6920. Up to 930 conditions per place. [2025-03-09 01:30:44,260 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 91 selfloop transitions, 50 changer transitions 4/146 dead transitions. [2025-03-09 01:30:44,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 146 transitions, 1797 flow [2025-03-09 01:30:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2025-03-09 01:30:44,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020671834625323 [2025-03-09 01:30:44,261 INFO L175 Difference]: Start difference. First operand has 89 places, 99 transitions, 1141 flow. Second operand 9 states and 233 transitions. [2025-03-09 01:30:44,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 146 transitions, 1797 flow [2025-03-09 01:30:44,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 146 transitions, 1757 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:44,280 INFO L231 Difference]: Finished difference. Result has 100 places, 108 transitions, 1377 flow [2025-03-09 01:30:44,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1377, PETRI_PLACES=100, PETRI_TRANSITIONS=108} [2025-03-09 01:30:44,281 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2025-03-09 01:30:44,281 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 108 transitions, 1377 flow [2025-03-09 01:30:44,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:44,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:44,281 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-09 01:30:44,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:44,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:44,486 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:44,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash 566847846, now seen corresponding path program 1 times [2025-03-09 01:30:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:44,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5935388] [2025-03-09 01:30:44,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:44,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:44,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:30:44,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:30:44,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:44,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:44,546 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-09 01:30:44,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5935388] [2025-03-09 01:30:44,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5935388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:44,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:44,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714503721] [2025-03-09 01:30:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:44,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:44,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:44,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:44,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:44,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:44,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 108 transitions, 1377 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:44,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:44,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:44,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:44,727 INFO L124 PetriNetUnfolderBase]: 807/1413 cut-off events. [2025-03-09 01:30:44,727 INFO L125 PetriNetUnfolderBase]: For 11566/11566 co-relation queries the response was YES. [2025-03-09 01:30:44,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7890 conditions, 1413 events. 807/1413 cut-off events. For 11566/11566 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6749 event pairs, 298 based on Foata normal form. 18/1431 useless extension candidates. Maximal degree in co-relation 6986. Up to 1044 conditions per place. [2025-03-09 01:30:44,733 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 97 selfloop transitions, 21 changer transitions 8/127 dead transitions. [2025-03-09 01:30:44,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 127 transitions, 1730 flow [2025-03-09 01:30:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-09 01:30:44,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6325581395348837 [2025-03-09 01:30:44,736 INFO L175 Difference]: Start difference. First operand has 100 places, 108 transitions, 1377 flow. Second operand 5 states and 136 transitions. [2025-03-09 01:30:44,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 127 transitions, 1730 flow [2025-03-09 01:30:44,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 1603 flow, removed 21 selfloop flow, removed 6 redundant places. [2025-03-09 01:30:44,757 INFO L231 Difference]: Finished difference. Result has 100 places, 108 transitions, 1327 flow [2025-03-09 01:30:44,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1327, PETRI_PLACES=100, PETRI_TRANSITIONS=108} [2025-03-09 01:30:44,757 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2025-03-09 01:30:44,757 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 108 transitions, 1327 flow [2025-03-09 01:30:44,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:44,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:44,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:44,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:30:44,758 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:44,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:44,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1546708519, now seen corresponding path program 1 times [2025-03-09 01:30:44,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:44,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260158539] [2025-03-09 01:30:44,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:44,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:30:44,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:30:44,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:44,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260158539] [2025-03-09 01:30:44,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260158539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624459973] [2025-03-09 01:30:44,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:44,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:44,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:44,918 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:44,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:30:44,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:30:44,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:30:44,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:44,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:44,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 01:30:44,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:44,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:30:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:45,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:45,476 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 102 treesize of output 90 [2025-03-09 01:30:45,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:30:45,573 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 532 treesize of output 436 [2025-03-09 01:30:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:49,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624459973] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:49,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:49,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 21 [2025-03-09 01:30:49,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295405279] [2025-03-09 01:30:49,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:49,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:30:49,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:49,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:30:49,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:30:50,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:50,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 108 transitions, 1327 flow. Second operand has 21 states, 21 states have (on average 21.285714285714285) internal successors, (447), 21 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:50,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:50,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:50,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:52,373 INFO L124 PetriNetUnfolderBase]: 1648/2838 cut-off events. [2025-03-09 01:30:52,374 INFO L125 PetriNetUnfolderBase]: For 19159/19159 co-relation queries the response was YES. [2025-03-09 01:30:52,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14955 conditions, 2838 events. 1648/2838 cut-off events. For 19159/19159 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14406 event pairs, 42 based on Foata normal form. 86/2924 useless extension candidates. Maximal degree in co-relation 13837. Up to 775 conditions per place. [2025-03-09 01:30:52,386 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 149 selfloop transitions, 94 changer transitions 159/403 dead transitions. [2025-03-09 01:30:52,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 403 transitions, 4549 flow [2025-03-09 01:30:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 01:30:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-09 01:30:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 793 transitions. [2025-03-09 01:30:52,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147286821705427 [2025-03-09 01:30:52,389 INFO L175 Difference]: Start difference. First operand has 100 places, 108 transitions, 1327 flow. Second operand 30 states and 793 transitions. [2025-03-09 01:30:52,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 403 transitions, 4549 flow [2025-03-09 01:30:52,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 403 transitions, 4475 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:52,426 INFO L231 Difference]: Finished difference. Result has 138 places, 147 transitions, 1833 flow [2025-03-09 01:30:52,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1833, PETRI_PLACES=138, PETRI_TRANSITIONS=147} [2025-03-09 01:30:52,427 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 94 predicate places. [2025-03-09 01:30:52,427 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 147 transitions, 1833 flow [2025-03-09 01:30:52,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 21.285714285714285) internal successors, (447), 21 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:52,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:52,428 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, 1, 1] [2025-03-09 01:30:52,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:30:52,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 01:30:52,632 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1470414798, now seen corresponding path program 2 times [2025-03-09 01:30:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828714552] [2025-03-09 01:30:52,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:52,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 01:30:52,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:30:52,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:52,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:53,768 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-09 01:30:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828714552] [2025-03-09 01:30:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828714552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799079481] [2025-03-09 01:30:53,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:53,770 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:53,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:30:53,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 01:30:53,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:30:53,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:53,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:53,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:30:53,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:54,871 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-09 01:30:54,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:55,612 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-09 01:30:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799079481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:55,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:55,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-03-09 01:30:55,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467314550] [2025-03-09 01:30:55,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:55,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:30:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:55,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:30:55,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:30:55,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:55,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 147 transitions, 1833 flow. Second operand has 16 states, 16 states have (on average 20.625) internal successors, (330), 16 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:55,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:55,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:55,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:58,100 INFO L124 PetriNetUnfolderBase]: 1388/2454 cut-off events. [2025-03-09 01:30:58,100 INFO L125 PetriNetUnfolderBase]: For 33941/33941 co-relation queries the response was YES. [2025-03-09 01:30:58,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16153 conditions, 2454 events. 1388/2454 cut-off events. For 33941/33941 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12200 event pairs, 227 based on Foata normal form. 69/2523 useless extension candidates. Maximal degree in co-relation 16104. Up to 636 conditions per place. [2025-03-09 01:30:58,116 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 300 selfloop transitions, 80 changer transitions 15/396 dead transitions. [2025-03-09 01:30:58,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 396 transitions, 5240 flow [2025-03-09 01:30:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:30:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:30:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 574 transitions. [2025-03-09 01:30:58,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6067653276955602 [2025-03-09 01:30:58,117 INFO L175 Difference]: Start difference. First operand has 138 places, 147 transitions, 1833 flow. Second operand 22 states and 574 transitions. [2025-03-09 01:30:58,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 396 transitions, 5240 flow [2025-03-09 01:30:58,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 396 transitions, 4651 flow, removed 271 selfloop flow, removed 20 redundant places. [2025-03-09 01:30:58,169 INFO L231 Difference]: Finished difference. Result has 132 places, 199 transitions, 2452 flow [2025-03-09 01:30:58,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2452, PETRI_PLACES=132, PETRI_TRANSITIONS=199} [2025-03-09 01:30:58,170 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 88 predicate places. [2025-03-09 01:30:58,170 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 199 transitions, 2452 flow [2025-03-09 01:30:58,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.625) internal successors, (330), 16 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:58,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:58,171 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, 1, 1] [2025-03-09 01:30:58,190 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-09 01:30:58,371 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,SelfDestructingSolverStorable21 [2025-03-09 01:30:58,371 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:58,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash -723671322, now seen corresponding path program 3 times [2025-03-09 01:30:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:58,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864022088] [2025-03-09 01:30:58,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:58,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:58,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-09 01:30:58,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:30:58,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:30:58,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:30:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864022088] [2025-03-09 01:30:58,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864022088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633102916] [2025-03-09 01:30:58,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:58,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:58,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:58,632 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-09 01:30:58,634 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-09 01:30:58,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-09 01:30:58,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:30:58,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:30:58,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:58,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:30:58,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:58,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:30:59,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633102916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:59,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:59,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 18 [2025-03-09 01:30:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55408709] [2025-03-09 01:30:59,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:59,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:30:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:59,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:30:59,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:30:59,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-09 01:30:59,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 199 transitions, 2452 flow. Second operand has 18 states, 18 states have (on average 21.0) internal successors, (378), 18 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:59,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:59,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-09 01:30:59,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:00,601 INFO L124 PetriNetUnfolderBase]: 1161/1990 cut-off events. [2025-03-09 01:31:00,601 INFO L125 PetriNetUnfolderBase]: For 29982/29982 co-relation queries the response was YES. [2025-03-09 01:31:00,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13480 conditions, 1990 events. 1161/1990 cut-off events. For 29982/29982 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8761 event pairs, 119 based on Foata normal form. 148/2138 useless extension candidates. Maximal degree in co-relation 13435. Up to 622 conditions per place. [2025-03-09 01:31:00,612 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 259 selfloop transitions, 81 changer transitions 0/341 dead transitions. [2025-03-09 01:31:00,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 341 transitions, 4668 flow [2025-03-09 01:31:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:31:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:31:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 384 transitions. [2025-03-09 01:31:00,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6378737541528239 [2025-03-09 01:31:00,613 INFO L175 Difference]: Start difference. First operand has 132 places, 199 transitions, 2452 flow. Second operand 14 states and 384 transitions. [2025-03-09 01:31:00,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 341 transitions, 4668 flow [2025-03-09 01:31:00,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 341 transitions, 4231 flow, removed 191 selfloop flow, removed 12 redundant places. [2025-03-09 01:31:00,653 INFO L231 Difference]: Finished difference. Result has 129 places, 183 transitions, 2196 flow [2025-03-09 01:31:00,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2196, PETRI_PLACES=129, PETRI_TRANSITIONS=183} [2025-03-09 01:31:00,653 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places. [2025-03-09 01:31:00,654 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 183 transitions, 2196 flow [2025-03-09 01:31:00,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.0) internal successors, (378), 18 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:00,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:00,654 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:00,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 01:31:00,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:00,856 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:00,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash 302116697, now seen corresponding path program 4 times [2025-03-09 01:31:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:00,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830463589] [2025-03-09 01:31:00,856 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:00,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:00,861 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:31:00,900 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:31:00,901 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:00,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:31:02,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:02,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830463589] [2025-03-09 01:31:02,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830463589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:02,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007101168] [2025-03-09 01:31:02,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:02,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:02,383 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:02,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:31:02,421 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:31:02,475 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:31:02,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:02,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:02,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-09 01:31:02,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:02,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:31:03,100 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-09 01:31:03,100 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 79 treesize of output 40 [2025-03-09 01:31:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:03,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:05,224 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 818 treesize of output 718 [2025-03-09 01:31:08,694 INFO L349 Elim1Store]: treesize reduction 5, result has 99.4 percent of original size [2025-03-09 01:31:08,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 25 new quantified variables, introduced 91 case distinctions, treesize of input 17611 treesize of output 8090